Tootfinder

Link groups of Kishino knot stacks
Blake K Winter
https://arxiv.org/abs/2405.05457 https://arxiv.org/pdf/2405.05457

Link groups of Kishino knot stacks
For any virtual link, a class of new links can be defined called stacks, in which copies of the virtual link are placed on top of one another. The resulting virtual link depends only on the virtual isotopy class of the original link, and the fundamental group of such a link may be used to detect whether the link is nontrivial and whether it is nonclassical in some cases. We show that this group is able to distinguish three Kishino knots from the unknot using a stacked pair. However, for a fourt…

This https://arxiv.org/abs/2308.14581 has been replaced.
link: https://scholar.google.com/scholar?q=a

Many-valued coalgebraic logic over semi-primal varieties
We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal algebra. We show that this can be extended to a technique to lift classical coalgebraic logics to many-valued ones, and that (one-step) completeness and expressivity are preserved under this lifting. For specific classes of endofunctors, we also describe how to obt…

This https://arxiv.org/abs/2012.15431 has been replaced.
link: https://scholar.google.com/scholar?q=a

Exact categories of topological vector spaces with linear topology
We explain why the naive definition of a natural exact category structure on complete, separated topological vector spaces with linear topology fails. In particular, contrary to arXiv:0711.2527, the category of such topological vector spaces is not quasi-abelian. We present a corrected definition of exact category structure which works OK. Then we explain that the corrected definition still has a shortcoming in that a natural tensor product functor is not exact in it, and discuss ways to refine…

This https://arxiv.org/abs/2404.01988 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cooperative Students: Navigating Unsupervised Domain Adaptation in Nighttime Object Detection
Unsupervised Domain Adaptation (UDA) has shown significant advancements in object detection under well-lit conditions; however, its performance degrades notably in low-visibility scenarios, especially at night, posing challenges not only for its adaptability in low signal-to-noise ratio (SNR) conditions but also for the reliability and efficiency of automated vehicles. To address this problem, we propose a \textbf{Co}operative \textbf{S}tudents (\textbf{CoS}) framework that innovatively employs…

Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint
Jun Li, Weiwei Zhang, Kang Wei, Guangji Chen, Long Shi, Wen Chen
https://arxiv.org/abs/2405.05802 …

Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint
As an emerging artificial intelligence technology, graph neural networks (GNNs) have exhibited promising performance across a wide range of graph-related applications. However, information exchanges among neighbor nodes in GNN pose new challenges in the resource-constrained scenario, especially in wireless systems. In practical wireless systems, the communication links among nodes are usually unreliable due to wireless fading and receiver noise, consequently resulting in performance degradation…

DWE : Dual-Way Matching Enhanced Framework for Multimodal Entity Linking
Shezheng Song, Shasha Li, Shan Zhao, Xiaopeng Li, Chengyu Wang, Jie Yu, Jun Ma, Tianwei Yan, Bin Ji, Xiaoguang Mao
https://arxiv.org/abs/2404.04818

DWE+: Dual-Way Matching Enhanced Framework for Multimodal Entity Linking
Multimodal entity linking (MEL) aims to utilize multimodal information (usually textual and visual information) to link ambiguous mentions to unambiguous entities in knowledge base. Current methods facing main issues: (1)treating the entire image as input may contain redundant information. (2)the insufficient utilization of entity-related information, such as attributes in images. (3)semantic inconsistency between the entity in knowledge base and its representation. To this end, we propose DWE+…

This https://arxiv.org/abs/2309.07359 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Fast WDM provisioning with minimal probing: the first field experiments for DC exchanges
We propose an approach to estimate the end-to-end GSNR accurately in a short time when a data center interconnect (DCI) network operator receives a service request from users, not by measuring the GSNR at the operational route and wavelength for the End-End optical path but by simply applying a QoT probe channel link by link, at a convenient wavelength/modulation-format for measurement. Assuming connections between coherent transceivers of various frequency ranges, modulators, and modulation fo…

Fair Graph Neural Network with Supervised Contrastive Regularization
Mahdi Tavassoli Kejani (UT3), Fadi Dornaika (IMT), Jean-Michel Loubes (IMT)
https://arxiv.org/abs/2404.06090 <…

Fair Graph Neural Network with Supervised Contrastive Regularization
In recent years, Graph Neural Networks (GNNs) have made significant advancements, particularly in tasks such as node classification, link prediction, and graph representation. However, challenges arise from biases that can be hidden not only in the node attributes but also in the connections between entities. Therefore, ensuring fairness in graph neural network learning has become a critical problem. To address this issue, we propose a novel model for training fairness-aware GNN, which enhances…

This https://arxiv.org/abs/2306.11227 has been replaced.
link: https://scholar.google.com/scholar?q=a

An Introduction to the Compute Express Link (CXL) Interconnect
The Compute Express Link (CXL) is an open industry-standard interconnect between processors and devices such as accelerators, memory buffers, smart network interfaces, persistent memory, and solid-state drives. CXL offers coherency and memory semantics with bandwidth that scales with PCIe bandwidth while achieving significantly lower latency than PCIe. All major CPU vendors, device vendors, and datacenter operators have adopted CXL as a common standard. This enables an inter-operable ecosystem …

This https://arxiv.org/abs/2404.15667 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Promise and Challenges of Using LLMs to Accelerate the Screening Process of Systematic Reviews
Systematic review (SR) is a popular research method in software engineering (SE). However, conducting an SR takes an average of 67 weeks. Thus, automating any step of the SR process could reduce the effort associated with SRs. Our objective is to investigate if Large Language Models (LLMs) can accelerate title-abstract screening by simplifying abstracts for human screeners, and automating title-abstract screening. We performed an experiment where humans screened titles and abstracts for 20 pape…

This https://arxiv.org/abs/2402.10318 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Multi-Antenna Towards Inband Shift Keying
We propose a new continuous phase frequency shift keying that is particularly suited for multi-antenna communications when the link budget is critical and beam alignment is problematic. It combines the constant envelope of frequency modulation with low-rate repetition coding in order to compensate for the absence of transmit beamforming. Although it is a frequency modulation, its transmit signal shows close to rectangular spectral shape. Similar to GSM's Gaussian minimum shift keying, it can be…

This https://arxiv.org/abs/2312.00345 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

IEEE 802.11be Network Throughput Optimization with Multi-Link Operation and AP Coordination
IEEE 802.11be (Wi-Fi 7) introduces a new concept called multi-link operation (MLO), which allows multiple Wi-Fi interfaces in different bands (2.4, 5, and 6 GHz) to work together to increase network throughput, reduce latency, and improve spectrum reuse efficiency in dense overlapping networks. To make the most of MLO, this paper proposes a new data-driven resource allocation algorithm for the 11be network with the aid of an access point (AP) controller. To maximize network throughput, a networ…

If your company website's "Live Chat Support" link goes to an error page, that tells me everything I need to know about your company.
Lookin' at you, #FitBit / #Google.

This https://arxiv.org/abs/2404.00797 has been replaced.
link: https://scholar.google.com/scholar?q=a

Metarobotics for Industry and Society: Vision, Technologies, and Opportunities
Metarobotics aims to combine next generation wireless communication, multi-sense immersion, and collective intelligence to provide a pervasive, itinerant, and non-invasive access and interaction with distant robotized applications. Industry and society are expected to benefit from these functionalities. For instance, robot programmers will no longer travel worldwide to plan and test robot motions, even collaboratively. Instead, they will have a personalized access to robots and their environmen…

This https://arxiv.org/abs/2404.00566 has been replaced.
link: https://scholar.google.com/scholar?q=a

CodeBenchGen: Creating Scalable Execution-based Code Generation Benchmarks
To facilitate evaluation of code generation systems across diverse scenarios, we present CodeBenchGen, a framework to create scalable execution-based benchmarks that only requires light guidance from humans. Specifically, we leverage a large language model (LLM) to convert an arbitrary piece of code into an evaluation example, including test cases for execution-based evaluation. We illustrate the usefulness of our framework by creating a dataset, Exec-CSN, which includes 1,931 examples involvin…

This https://arxiv.org/abs/2209.12578 has been replaced.
link: https://scholar.google.com/scholar?q=a

Every countable model of arithmetic or set theory has a pointwise-definable end extension
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of set theory, in which every individual is definable without parameters, challenges this conclusion. In this article, I introduce a flexible new method for constructing pointwise-definable models of arithmetic and set theory, showing furthermore that every coun…

This https://arxiv.org/abs/2402.01068 has been replaced.
link: https://scholar.google.com/scholar?q=a

Unbreakable and breakable quantum censorship
A protocol for regulating the distribution of quantum information between multiple parties is put forward. In order to prohibit the unrestricted distribution of quantum-resource states in a public quantum network, agents can apply a resource-destroying map to each sender's channel. Since resource-destroying maps only exist for affine quantum resource theories, censorship of a nonaffine resource theory is established on an operationally motivated subspace of free states. This is achieved by usin…

This https://arxiv.org/abs/2210.03744 has been replaced.
link: https://scholar.google.com/scholar?q=a

Fermat's Last Theorem over $\mathbb{Q}(\sqrt{2},\sqrt{3})$
In this paper, we begin the study of the Fermat equation $x^n+y^n=z^n$ over real biquadratic fields. In particular, we prove that there are no non-trivial solutions to the Fermat equation over $\mathbb{Q}(\sqrt{2},\sqrt{3})$ for $n\geq 4$.

This https://arxiv.org/abs/2201.13448 has been replaced.
link: https://scholar.google.com/scholar?q=a

Warmth and competence in human-agent cooperation
Interaction and cooperation with humans are overarching aspirations of artificial intelligence (AI) research. Recent studies demonstrate that AI agents trained with deep reinforcement learning are capable of collaborating with humans. These studies primarily evaluate human compatibility through "objective" metrics such as task performance, obscuring potential variation in the levels of trust and subjective preference that different agents garner. To better understand the factors shaping subject…

This https://arxiv.org/abs/2205.10580 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules
Electronic voting systems are essential for holding virtual elections, and the need for such systems increases due to the COVID-19 pandemic and the social distancing that it mandates. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots, and that the privacy of the voters is preserved. We propose herein a secure voting protocol for elections that are governed by order-based voting rules.…

This https://arxiv.org/abs/1406.0886 has been replaced.
link: https://scholar.google.com/scholar?q=a<…

A system of polynomial equations related to the Jacobian Conjecture
We prove that the Jacobian conjecture is false if and only if there exists a solution to a certain system of polynomial equations. We analyse the solution set of this system. In particular we prove that it is zero dimensional.

This https://arxiv.org/abs/2211.05690 has been replaced.
link: https://scholar.google.com/scholar?q=a

Robust Model Selection of Gaussian Graphical Models
In Gaussian graphical model selection, noise-corrupted samples present significant challenges. It is known that even minimal amounts of noise can obscure the underlying structure, leading to fundamental identifiability issues. A recent line of work addressing this "robust model selection" problem narrows its focus to tree-structured graphical models. Even within this specific class of models, exact structure recovery is shown to be impossible. However, several algorithms have been developed tha…

This https://arxiv.org/abs/2212.08739 has been replaced.
link: https://scholar.google.com/scholar?q=a

Product structure extension of the Alon--Seymour--Thomas theorem
Alon, Seymour and Thomas [1990] proved that every $n$-vertex graph excluding $K_t$ as a minor has treewidth less than $t^{3/2}\sqrt{n}$. Illingworth, Scott and Wood [2022] recently refined this result by showing that every such graph is a subgraph of some graph with treewidth $t-2$, where each vertex is blown up by a complete graph of order $O(\sqrt{tn})$. Solving an open problem of Illingworth, Scott and Wood [2022], we prove that the treewidth bound can be reduced to $4$ while keeping blowups…

This https://arxiv.org/abs/2105.14307 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards a Dichotomy for Minimally Factorizing the Provenance of Self-Join Free Conjunctive Queries
We consider the problem of finding the minimal-size factorization of the provenance of self-join-free conjunctive queries, i.e., we want to find a formula that \emph{minimizes the number of variable repetitions}. This problem is equivalent to solving the fundamental Boolean formula factorization problem for the restricted setting of the provenance formulas of self-join free queries. While general Boolean formula minimization is $Σ^p_2$-complete, we show that the problem is NP-C in our case. Ad…

This https://arxiv.org/abs/2403.08115 has been replaced.
link: https://scholar.google.com/scholar?q=a

Legally Binding but Unfair? Towards Assessing Fairness of Privacy Policies
Privacy policies are expected to inform data subjects about their data protection rights and should explain the data controller's data management practices. Privacy policies only fulfill their purpose, if they are correctly interpreted, understood, and trusted by the data subject. This implies that a privacy policy is written in a fair way, e.g., it does not use polarizing terms, does not require a certain education, or does not assume a particular social background. We outline our approach to …

This https://arxiv.org/abs/2402.01129 has been replaced.
link: https://scholar.google.com/scholar?q=a

Satellite fully positive braid links are braided satellite of fully positive braid links
A link in $S^{3}$ is a fully positive braid link if it is the closure of a positive braid that contains at least one full-twist. We show that a fully positive braid link is a satellite link if and only if it is the satellite of a fully positive braid link $C$ such that the pattern is a positive braid that contains sufficiently many full twists, where the number of necessary full twists only depends on $C$. As an application, we give a characterization of the unknot by the property that certain …

This https://arxiv.org/abs/2401.03752 has been replaced.
link: https://scholar.google.com/scholar?q=a

Is Limited Information Enough? An Approximate Multi-agent Coverage Control in Non-Convex Discrete Environments
Conventional distributed approaches to coverage control may suffer from lack of convergence and poor performance, due to the fact that agents have limited information, especially in non-convex discrete environments. To address this issue, we extend the approach of [Marden 2016] which demonstrates how a limited degree of inter-agent communication can be exploited to overcome such pitfalls in one-dimensional discrete environments. The focus of this paper is on extending such results to general di…

This https://arxiv.org/abs/1907.08987 has been replaced.
link: https://scholar.google.com/scholar?q=a

Self-gravitating razor-thin disks around black holes via multi-hole seeds
We construct self-gravitating razor-thin disks of counterrotating dust around Schwarzschild black holes (BHs) by applying the "displace, cut, and reflect" method to known seed solutions representing multi-holes. All but one of the sources of the seed solution generate the surrounding annular disk, whereas the remaining BH is kept unaltered and lies at the disk center after the transformation. The disks are infinite in extent, have annular character, and are linearly stable up to the innermost s…

This https://arxiv.org/abs/2310.11425 has been replaced.
link: https://scholar.google.com/scholar?q=a

Remarks on effects of projective phase on eigenstate thermalization hypothesis
The existence of $p$-form symmetry in $(d+1)$-dimensional quantum field is known to always lead to the breakdown of the eigenstate thermalization hypothesis (ETH) for certain $(d-p)$-dimensional operators other than symmetry operators under some assumptions. The assumptions include the mixing of symmetry sectors within a given energy shell, which is rather challenging to verify because it requires information on the eigenstates in the middle of the spectrum. We reconsider this assumption from t…

This https://arxiv.org/abs/2210.13020 has been replaced.
link: https://scholar.google.com/scholar?q=a

On Tools for Completeness of Kleene Algebra with Hypotheses
In the literature on Kleene algebra, a number of variants have been proposed which impose additional structure specified by a theory, such as Kleene algebra with tests (KAT) and the recent Kleene algebra with observations (KAO), or make specific assumptions about certain constants, as for instance in NetKAT. Many of these variants fit within the unifying perspective offered by Kleene algebra with hypotheses, which comes with a canonical language model constructed from a given set of hypotheses.…

This https://arxiv.org/abs/2403.01517 has been replaced.
link: https://scholar.google.com/scholar?q=a

MatchU: Matching Unseen Objects for 6D Pose Estimation from RGB-D Images
Recent learning methods for object pose estimation require resource-intensive training for each individual object instance or category, hampering their scalability in real applications when confronted with previously unseen objects. In this paper, we propose MatchU, a Fuse-Describe-Match strategy for 6D pose estimation from RGB-D images. MatchU is a generic approach that fuses 2D texture and 3D geometric cues for 6D pose prediction of unseen objects. We rely on learning geometric 3D descriptors…

This https://arxiv.org/abs/2310.05384 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cartesian double theories: A double-categorical framework for categorical doctrines
The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category theory. A cartesian double theory is defined to be a small double category with finite products and a model of a cartesian double theory to be a finite product-preserving lax functor out of it. Many familiar categorical structures are models of cartesian double t…

This https://arxiv.org/abs/2403.02333 has been replaced.
link: https://scholar.google.com/scholar?q=a

Key-Point-Driven Data Synthesis with its Enhancement on Mathematical Reasoning
Large language models (LLMs) have shown great potential in complex reasoning tasks, yet their performance is often hampered by the scarcity of high-quality and reasoning-focused training datasets. Addressing this challenge, we propose Key-Point-Driven Data Synthesis (KPDDS), a novel data synthesis framework that synthesizes question-answer pairs by leveraging key points and exemplar practices from authentic data sources. KPDDS ensures the generation of novel questions with rigorous quality cont…

This https://arxiv.org/abs/2402.10318 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Multi-Antenna Towards Inband Shift Keying
We propose a new continuous phase frequency shift keying that is particularly suited for multi-antenna communications when the link budget is critical and beam alignment is problematic. It combines the constant envelope of frequency modulation with low-rate repetition coding in order to compensate for the absence of transmit beamforming. Although it is a frequency modulation, its transmit signal shows close to rectangular spectral shape. Similar to GSM's Gaussian minimum shift keying, it can be…

This https://arxiv.org/abs/2402.04768 has been replaced.
link: https://scholar.google.com/scholar?q=a

Robot Interaction Behavior Generation based on Social Motion Forecasting for Human-Robot Interaction
Integrating robots into populated environments is a complex challenge that requires an understanding of human social dynamics. In this work, we propose to model social motion forecasting in a shared human-robot representation space, which facilitates us to synthesize robot motions that interact with humans in social scenarios despite not observing any robot in the motion training. We develop a transformer-based architecture called ECHO, which operates in the aforementioned shared space to predi…

This https://arxiv.org/abs/2311.07298 has been replaced.
link: https://scholar.google.com/scholar?q=a

Energy and Time Complexity for Sorting Algorithms in Java
The article investigates the relationship between time complexity and energy consumption in sorting algorithms, focusing on commonly-used algorithms implemented in Java: Bubble Sort, Counting Sort, Merge Sort, and Quick Sort. The significance of understanding this relationship is driven by the increasing energy demands of Information and Communication Technology systems and the potential for software optimization to contribute to energy efficiency. If we find a strong correlation between time c…

This https://arxiv.org/abs/2206.05677 has been replaced.
link: https://scholar.google.com/scholar?q=a

On groups interpretable in various valued fields
We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it is abelian-by-finite. Along the way, we associate with any infinite interpretable group an infinite type-definable subgroup which is definably isomorphic to a group in one of four distinguished sorts: the underlying valued field $K$, its residue field $\ma…

This https://arxiv.org/abs/2401.17450 has been replaced.
link: https://scholar.google.com/scholar?q=a

Qplacer: Frequency-Aware Component Placement for Superconducting Quantum Computers
Noisy Intermediate-Scale Quantum (NISQ) computers face a critical limitation in qubit numbers, hindering their progression towards large-scale and fault-tolerant quantum computing. A significant challenge impeding scaling is crosstalk, characterized by unwanted interactions among neighboring components on quantum chips, including qubits, resonators, and substrate. We motivate a general approach to systematically resolving multifaceted crosstalks in a limited substrate area. We propose Qplacer, …

This https://arxiv.org/abs/2009.05084 has been replaced.
link: https://scholar.google.com/scholar?q=a

The relatively perfect Greenberg transform and cycle class maps
Given a scheme over a complete discrete valuation ring of mixed characteristic with perfect residue field, the Greenberg transform produces a new scheme over the residue field thicker than the special fiber. In this paper, we will generalize this transform to the case of imperfect residue field. We will then construct a certain kind of cycle class map defined on this generalized Greenberg transform applied to the Néron model of a semi-abelian variety, which takes values in the relatively perfe…

This https://arxiv.org/abs/2401.15541 has been replaced.
link: https://scholar.google.com/scholar?q=a

Stitching Satellites to the Edge: Pervasive and Efficient Federated LEO Satellite Learning
In the ambitious realm of space AI, the integration of federated learning (FL) with low Earth orbit (LEO) satellite constellations holds immense promise. However, many challenges persist in terms of feasibility, learning efficiency, and convergence. These hurdles stem from the bottleneck in communication, characterized by sporadic and irregular connectivity between LEO satellites and ground stations, coupled with the limited computation capability of satellite edge computing (SEC). This paper p…

This https://arxiv.org/abs/2404.00076 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Backdoor Approach with Inverted Labels Using Dirty Label-Flipping Attacks
Audio-based machine learning systems frequently use public or third-party data, which might be inaccurate. This exposes deep neural network (DNN) models trained on such data to potential data poisoning attacks. In this type of assault, attackers can train the DNN model using poisoned data, potentially degrading its performance. Another type of data poisoning attack that is extremely relevant to our investigation is label flipping, in which the attacker manipulates the labels for a subset of dat…

This https://arxiv.org/abs/2210.14781 has been replaced.
link: https://scholar.google.com/scholar?q=a

On K-moduli of quartic threefolds
The family of smooth Fano 3-folds with Picard rank 1 and anticanonical volume 4 consists of quartic 3-folds and of double covers of the 3-dimensional quadric branched along an octic surface. They can all be parametrised as complete intersections of a quadric and a quartic in the weighted projective space $\mathbb{P}(1,1,1,1,1,2)$, denoted by $X_{2,4} \subset \mathbb{P}(1^5,2)$; all such smooth complete intersections are K-stable. With the aim of investigating the compactification of the moduli …

This https://arxiv.org/abs/2208.00117 has been replaced.
link: https://scholar.google.com/scholar?q=a

Two-Point Concentration of the Independence Number of the Random Graph
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ ε} < p \le 1$. This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in general, concentrated on 2 values for $ p = o \left( (\log(n)/n)^{2/3} \right)$. The extent of concentration of the independence number of $ G_{n,p}$ for $ ω(1/n)

This https://arxiv.org/abs/2203.00362 has been replaced.
link: https://scholar.google.com/scholar?q=a

Reasonable Space for the $λ$-Calculus, Logarithmically
Can the $λ$-calculus be considered a reasonable computational model? Can we use it for measuring the time $\textit{and}$ space consumption of algorithms? While the literature contains positive answers about time, much less is known about space. This paper presents a new reasonable space cost model for the $λ$-calculus, based on a variant over the Krivine abstract machine. For the first time, this cost model is able to accommodate logarithmic space. Moreover, we study the time behavior of our …

This https://arxiv.org/abs/2112.14758 has been replaced.
link: https://scholar.google.com/scholar?q=a

Multivariate Trend Filtering for Lattice Data
We study a multivariate version of trend filtering, called Kronecker trend filtering or KTF, for the case in which the design points form a lattice in $d$ dimensions. KTF is a natural extension of univariate trend filtering (Steidl et al., 2006; Kim et al., 2009; Tibshirani, 2014), and is defined by minimizing a penalized least squares problem whose penalty term sums the absolute (higher-order) differences of the parameter to be estimated along each of the coordinate directions. The correspondi…

This https://arxiv.org/abs/2212.03601 has been replaced.
link: https://scholar.google.com/scholar?q=a

Artificial Intelligence in Governance, Risk and Compliance: Results of a study on potentials for the application of artificial intelligence (AI) in governance, risk and compliance (GRC)
The digital transformation leads to fundamental change in organizational structures. To be able to apply new technologies not only selectively, processes in companies must be revised and functional units must be viewed holistically, especially with regard to interfaces. Target-oriented management decisions are made, among other things, on the basis of risk management and compliance in combination with the internal control system as governance functions. The effectiveness and efficiency of these…

Liquid Neural Network-based Adaptive Learning vs. Incremental Learning for Link Load Prediction amid Concept Drift due to Network Failures
Omran Ayoub, Davide Andreoletti, Aleksandra Knapi\'nska, R\'o\.za Go\'scie\'n, Piotr Lechowicz, Tiziano Leidi, Silvia Giordano, Cristina Rottondi, Krzysztof Walkowiak
https://…

Liquid Neural Network-based Adaptive Learning vs. Incremental Learning for Link Load Prediction amid Concept Drift due to Network Failures
Adapting to concept drift is a challenging task in machine learning, which is usually tackled using incremental learning techniques that periodically re-fit a learning model leveraging newly available data. A primary limitation of these techniques is their reliance on substantial amounts of data for retraining. The necessity of acquiring fresh data introduces temporal delays prior to retraining, potentially rendering the models inaccurate if a sudden concept drift occurs in-between two consecut…

This https://arxiv.org/abs/1907.08987 has been replaced.
link: https://scholar.google.com/scholar?q=a

Self-gravitating razor-thin disks around black holes via multi-hole seeds
We construct self-gravitating razor-thin disks of counterrotating dust around Schwarzschild black holes (BHs) by applying the "displace, cut, and reflect" method to known seed solutions representing multi-holes. All but one of the sources of the seed solution generate the surrounding annular disk, whereas the remaining BH is kept unaltered and lies at the disk center after the transformation. The disks are infinite in extent, have annular character, and are linearly stable up to the innermost s…

This https://arxiv.org/abs/2211.10113 has been replaced.
link: https://scholar.google.com/scholar?q=a

Algebro-geometrical orientifolds and IR dualities
Orientifold projections are an important ingredient in geometrical engineering of Quantum Field Theory. However, an orientifold can break down the superconformal symmetry and no new superconformal fixed points are admitted (II scenario); nevertheless, in some cases, dubbed I and III scenarios orientifold, a new IR fixed point is achieved and, for III scenario examples, some still not fully understood IR duality seems to emerge. Here we give an algebro-geometrical point of view of III scenario o…

This https://arxiv.org/abs/2402.04101 has been replaced.
link: https://scholar.google.com/scholar?q=a

VRMM: A Volumetric Relightable Morphable Head Model
In this paper, we introduce the Volumetric Relightable Morphable Model (VRMM), a novel volumetric and parametric facial prior for 3D face modeling. While recent volumetric prior models offer improvements over traditional methods like 3D Morphable Models (3DMMs), they face challenges in model learning and personalized reconstructions. Our VRMM overcomes these by employing a novel training framework that efficiently disentangles and encodes latent spaces of identity, expression, and lighting into…

This https://arxiv.org/abs/2402.05812 has been replaced.
link: https://scholar.google.com/scholar?q=a

FAQ-Gen: An automated system to generate domain-specific FAQs to aid content comprehension
Frequently Asked Questions (FAQs) refer to the most common inquiries about specific content. They serve as content comprehension aids by simplifying topics and enhancing understanding through succinct presentation of information. In this paper, we address FAQ generation as a well-defined Natural Language Processing task through the development of an end-to-end system leveraging text-to-text transformation models. We present a literature review covering traditional question-answering systems, hi…

This https://arxiv.org/abs/2402.04070 has been replaced.
link: https://scholar.google.com/scholar?q=a

Spatial Assisted Human-Drone Collaborative Navigation and Interaction through Immersive Mixed Reality
Aerial robots have the potential to play a crucial role in assisting humans with complex and dangerous tasks. Nevertheless, the future industry demands innovative solutions to streamline the interaction process between humans and drones to enable seamless collaboration and efficient co-working. In this paper, we present a novel tele-immersive framework that promotes cognitive and physical collaboration between humans and robots through Mixed Reality (MR). This framework incorporates a novel bi-…

This https://arxiv.org/abs/2307.00593 has been replaced.
link: https://scholar.google.com/scholar?q=a

Isolating Compiler Bugs by Generating Effective Witness Programs with Large Language Models
Compiler bugs pose a significant threat to safety-critical applications, and promptly as well as effectively isolating these bugs is crucial for assuring the quality of compilers. However, the limited availability of debugging information on reported bugs complicates the compiler bug isolation task. Existing compiler bug isolation approaches convert the problem into a test program mutation problem, but they are still limited by ineffective mutation strategies or high human effort requirements. …

This https://arxiv.org/abs/2110.01673 has been replaced.
link: https://scholar.google.com/scholar?q=a

Model-completeness and decidability of the additive structure of integers expanded with a function for a Beatty sequence
We introduce a recursive model-complete theory which completely axiomatizes the structure $Z_α=(Z, +, 0, 1, f)$ where $f : x \to \lfloorα x \rfloor $ is a unary function with $α$ a fixed transcendental number.When α$ is computable, our theory is recursively enumerable, and hence decidable as a result of completeness. Therefore, this result fits into the more general theme of adding traces of multiplication to integers without losing decidability.

This https://arxiv.org/abs/2404.00446 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards a Semantic Characterisation of Global Type Well-formedness
We address the question of characterising the well-formedness properties of multiparty session types semantically, i.e., as properties of the semantic model used to interpret types. Choosing Prime Event Structures (PESs) as our semantic model, we present semantic counterparts for the two properties that underpin global type well-formedness, namely projectability and boundedness, in this model. As a first step towards a characterisation of the class of PESs corresponding to well-formed global t…

This https://arxiv.org/abs/2404.00624 has been replaced.
link: https://scholar.google.com/scholar?q=a

On The Friendly Number Of 10
To answer the question "Is $10$ a solitary number?", we have established a necessary and sufficient condition on primes $p$ and $q$ so that $p$ divides $σ(q^{2a})$($a\in\mathbb{Z^+}$). Also We have found the form of $q$ whenever $p$ divides $σ(q^{2a})$ for $q>p$ . Using these two, we have proved that if $n$ is a friend of $10$ then it is an odd square with at least seven distinct prime factors, $5$ being the least one. Moreover there exists a prime factor $p$ of $n$ such that $2a+1\equiv 0 \p…

This https://arxiv.org/abs/2210.04410 has been replaced.
link: https://scholar.google.com/scholar?q=a

Accelerating the Delivery of Data Services over Uncertain Mobile Crowdsensing Networks
The challenge of exchanging and processing of big data over mobile crowdsensing (MCS) networks calls for designing seamless data service provisioning mechanisms to enable utilization of resources of mobile devices/users for crowdsensing tasks. Although conventional onsite spot trading of resources based on real-time network conditions can facilitate data sharing, it often suffers from prohibitively long service provisioning delays and unavoidable trading failures due to requiring timely analysi…

This https://arxiv.org/abs/2212.09268 has been replaced.
link: https://scholar.google.com/scholar?q=a

UAVCAN Dataset Description
We collected attack data from unmanned vehicles using the UAVCAN protocol, and public and described technical documents. A testbed was built with a drone using PX4, and a total of three attacks, Flooding, Fuzzy, and Replay, were performed. The attack was carried out in a total of 10 scenarios. We expect that the attack data will help develop technologies such as anomaly detection to solve the security threat problem of drones.

This https://arxiv.org/abs/2402.03312 has been replaced.
link: https://scholar.google.com/scholar?q=a

Test-Time Adaptation for Depth Completion
It is common to observe performance degradation when transferring models trained on some (source) datasets to target testing data due to a domain gap between them. Existing methods for bridging this gap, such as domain adaptation (DA), may require the source data on which the model was trained (often not available), while others, i.e., source-free DA, require many passes through the testing data. We propose an online test-time adaptation method for depth completion, the task of inferring a dens…

This https://arxiv.org/abs/2206.06839 has been replaced.
link: https://scholar.google.com/scholar?q=a

Filtrations and torsion pairs in Abramovich Polishchuk's heart
We study some abelian subcategories and torsion pairs in Abramovich Polishchuk's heart. And we construct stability conditions on a full triangulated subcategory $\mathcal{D}^{\leq 1}_S$ in $D(X\times S)$, for an arbitrary smooth projective variety S. We also define a notion of $l$-th level stability, which is a generalization of the slope stability and the Gieseker stability. We show that for any object E in Abramovich Polishchuk's heart, there is a unique filtration whose factors are $l$-th le…

This https://arxiv.org/abs/2202.09858 has been replaced.
link: https://scholar.google.com/scholar?q=a

The real equiangular tight frames obtained from rank $3$ graphs
We present all nontrivial real equiangular tight frames $\{φ_m\}_{m=1}^M$ in $\mathbb{R}^N$ obtained as spherical embeddings of primitive rank $3$ graphs on $M$ vertices, and those such that one of their associated $M$ strongly regular graphs on $M-1$ vertices is a primitive rank $3$ graph.

This https://arxiv.org/abs/2001.03048 has been replaced.
link: https://scholar.google.com/scholar?q=a

Resource-Efficient Neural Networks for Embedded Systems
While machine learning is traditionally a resource intensive task, embedded systems, autonomous navigation, and the vision of the Internet of Things fuel the interest in resource-efficient approaches. These approaches aim for a carefully chosen trade-off between performance and resource consumption in terms of computation and energy. The development of such approaches is among the major challenges in current machine learning research and key to ensure a smooth transition of machine learning tec…

This https://arxiv.org/abs/2309.13933 has been replaced.
link: https://scholar.google.com/scholar?q=a

Fairness and Bias in Algorithmic Hiring: a Multidisciplinary Survey
Employers are adopting algorithmic hiring technology throughout the recruitment pipeline. Algorithmic fairness is especially applicable in this domain due to its high stakes and structural inequalities. Unfortunately, most work in this space provides partial treatment, often constrained by two competing narratives, optimistically focused on replacing biased recruiter decisions or pessimistically pointing to the automation of discrimination. Whether, and more importantly what types of, algorithm…

This https://arxiv.org/abs/2308.06643 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Geometry of fundamental shadow link complements and applications to the 1-loop conjecture
We construct a geometric ideal triangulation for every fundamental shadow link complement and solve the gluing equation explicitly in terms of the logarithmic holonomies of the meridians of the link for any generic character in the distinguished component of the $\mathrm{PSL}(2;\mathbb{C})$-character variety of the link complement. As immediate applications, we obtain a new formula for the volume of a hyperideal tetrahedron in terms of its dihedral angles, and a formula for the volume of hyperb…

This https://arxiv.org/abs/1711.01922 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cosmological constant as quantum error correction from generalised gauge invariance in double field theory
The holographic principle and its realisation as the AdS/CFT correspondence leads to the existence of the so called precursor operators. These are boundary operators that carry non-local information regarding events occurring deep inside the bulk and which cannot be causally connected to the boundary. Such non-local operators can distinguish non-vacuum-like excitations within the bulk that cannot be observed by any local gauge invariant operators in the boundary. The boundary precursors are exp…

This https://arxiv.org/abs/2206.02480 has been replaced.
link: https://scholar.google.com/scholar?q=a

Subspace Phase Retrieval
In recent years, phase retrieval has received much attention in statistics, applied mathematics and optical engineering. In this paper, we propose an efficient algorithm, termed Subspace Phase Retrieval (SPR), which can accurately recover an $n$-dimensional $k$-sparse complex-valued signal $\x$ given its $Ω(k^2\log n)$ magnitude-only Gaussian samples if the minimum nonzero entry of $\x$ satisfies $|x_{\min}| = Ω(\|\x\|/\sqrt{k})$. Furthermore, if the energy sum of the most…

This https://arxiv.org/abs/2404.01201 has been replaced.
link: https://scholar.google.com/scholar?q=a

Search for gravitationally lensed interstellar transmissions
We consider interstellar light transmission facilitated by gravitational lensing. We study axially-symmetric lensing configurations where the transmitter, lens, and receiver are nearly aligned. With the transmitter positioned in the focal region of the lens, we investigate the caustic formed by a diffraction-limited beam of light emitted by the transmitter. We evaluated the impact of the lens's point spread function (PSF) on the received beam. We estimate the power delivered to a receiver at in…

This https://arxiv.org/abs/2401.08298 has been replaced.
link: https://scholar.google.com/scholar?q=a

Online Elasticity Estimation and Material Sorting Using Standard Robot Grippers
Standard robot grippers are not designed for material recognition. We experimentally evaluated the accuracy with which material properties can be estimated through object compression by two standard parallel jaw grippers and a force/torque sensor mounted at the robot wrist, with a professional biaxial compression device used as reference. Gripper effort versus position curves were obtained and transformed into stress/strain curves. The modulus of elasticity was estimated at different strain poi…

This https://arxiv.org/abs/2306.01987 has been replaced.
link: https://scholar.google.com/scholar?q=a

Prompting Is All You Need: Automated Android Bug Replay with Large Language Models
Bug reports are vital for software maintenance that allow users to inform developers of the problems encountered while using the software. As such, researchers have committed considerable resources toward automating bug replay to expedite the process of software maintenance. Nonetheless, the success of current automated approaches is largely dictated by the characteristics and quality of bug reports, as they are constrained by the limitations of manually-crafted patterns and pre-defined vocabul…

This https://arxiv.org/abs/2107.10817 has been replaced.
link: https://scholar.google.com/scholar?q=a

Team Semantics and Independence Notions in Quantum Physics
We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework introduced by the first author in a prior paper. This leads to new developments also in independence logic and probabilistic independence logic.

This https://arxiv.org/abs/2312.13286 has been replaced.
link: https://scholar.google.com/scholar?q=a

Generative Multimodal Models are In-Context Learners
The human ability to easily solve multimodal tasks in context (i.e., with only a few demonstrations or simple instructions), is what current multimodal systems have largely struggled to imitate. In this work, we demonstrate that the task-agnostic in-context learning capabilities of large multimodal models can be significantly enhanced by effective scaling-up. We introduce Emu2, a generative multimodal model with 37 billion parameters, trained on large-scale multimodal sequences with a unified a…

This https://arxiv.org/abs/2309.02325 has been replaced.
link: https://scholar.google.com/scholar?q=a

Monotone non-decreasing sequences of the Euler totient function
Let $M(x)$ denote the largest cardinality of a subset of $\{n \in \mathbf{N}: n \leq x\}$ on which the Euler totient function $φ(n)$ is non-decreasing. We show that $M(x) = (1+O(\frac{(\log\log x)^5}{\log x})) π(x)$ for all $x \geq 10$, answering questions of Erdős and Pollack--Pomerance--Treviño. A similar result is also obtained for the sum of divisors function $σ(n)$.

This https://arxiv.org/abs/2207.13478 has been replaced.
link: https://scholar.google.com/scholar?q=a

Partial Selfish Mining for More Profits
Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining. Selfish mining can preserve discovered blocks and strategically release them, wasting honest miners' computing resources and getting higher profits. Previous mining attacks either conceal the mined whole blocks (hiding or discarding), or release them completely in a particular time slot (e.g., causing a fork). In this paper, we extend the mining attack's strategy space to partial block sharing, and propose a n…

This https://arxiv.org/abs/2105.10141 has been replaced.
link: https://scholar.google.com/scholar?q=a

Tropical contractions to integral affine manifolds with singularities
We consider a toric degeneration of Calabi--Yau complete intersections of Batyrev--Borisov in the Gross--Siebert program. One can associate two types of tropical spaces with it. One is a tropical variety obtained by tropicalization. The other one is an integral affine manifold with singularities, which arises as the dual intersection complex of the toric degeneration. In this article, we show that the latter is contained in the former as a subset, and construct an integral affine contraction ma…

This https://arxiv.org/abs/2401.07164 has been replaced.
link: https://scholar.google.com/scholar?q=a

3QFP: Efficient neural implicit surface reconstruction using Tri-Quadtrees and Fourier feature Positional encoding
Neural implicit surface representations are currently receiving a lot of interest as a means to achieve high-fidelity surface reconstruction at a low memory cost, compared to traditional explicit representations.However, state-of-the-art methods still struggle with excessive memory usage and non-smooth surfaces. This is particularly problematic in large-scale applications with sparse inputs, as is common in robotics use cases. To address these issues, we first introduce a sparse structure, \emp…

This https://arxiv.org/abs/2404.03528 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

BanglaAutoKG: Automatic Bangla Knowledge Graph Construction with Semantic Neural Graph Filtering
Knowledge Graphs (KGs) have proven essential in information processing and reasoning applications because they link related entities and give context-rich information, supporting efficient information retrieval and knowledge discovery; presenting information flow in a very effective manner. Despite being widely used globally, Bangla is relatively underrepresented in KGs due to a lack of comprehensive datasets, encoders, NER (named entity recognition) models, POS (part-of-speech) taggers, and le…

This https://arxiv.org/abs/1706.03376 has been replaced.
link: https://scholar.google.com/scholar?q=a

Strongly Dependent Ordered Abelian Groups and Henselian Fields
Strongly dependent ordered abelian groups have finite dp-rank. They are precisely those groups with finite spines and $|\{p\text{ prime}:[G:pG]=\infty\}|<\infty$. We apply this to show that if $K$ is a strongly dependent field, then $(K,v)$ is strongly dependent for any henselian valuation $v$.

This https://arxiv.org/abs/2312.07539 has been replaced.
link: https://scholar.google.com/scholar?q=a

HeadArtist: Text-conditioned 3D Head Generation with Self Score Distillation
This work presents HeadArtist for 3D head generation from text descriptions. With a landmark-guided ControlNet serving as the generative prior, we come up with an efficient pipeline that optimizes a parameterized 3D head model under the supervision of the prior distillation itself. We call such a process self score distillation (SSD). In detail, given a sampled camera pose, we first render an image and its corresponding landmarks from the head model, and add some particular level of noise onto …

This https://arxiv.org/abs/2206.02480 has been replaced.
link: https://scholar.google.com/scholar?q=a

Subspace Phase Retrieval
In recent years, phase retrieval has received much attention in statistics, applied mathematics and optical engineering. In this paper, we propose an efficient algorithm, termed Subspace Phase Retrieval (SPR), which can accurately recover an $n$-dimensional $k$-sparse complex-valued signal $\x$ given its $Ω(k^2\log n)$ magnitude-only Gaussian samples if the minimum nonzero entry of $\x$ satisfies $|x_{\min}| = Ω(\|\x\|/\sqrt{k})$. Furthermore, if the energy sum of the most…

This https://arxiv.org/abs/2402.02594 has been replaced.
link: https://scholar.google.com/scholar?q=a

Gravitational Wave Displacement and Velocity Memory Effects
In this article, we compare in detail the linear and nonlinear approach to the Gravitational Waves Displacement and Velocity Memory (GWDM and GWVM) effects. We consider astrophysical situations that give rise to gravitational waves with GWVM effect, i.e. with a residual velocity (the so-called "velocity-coded memory") and discuss the possibility of future detection of the GWVM effect.

This https://arxiv.org/abs/2212.02249 has been replaced.
link: https://scholar.google.com/scholar?q=a

The symbol length for elementary type pro-$p$ groups and Massey products
For a prime number $p$ and an integer $m\geq2$, we prove that the symbol length of all elements of $m$-fold Massey products in $H^2(G,\mathbb{F}_p)$, for pro-$p$ groups $G$ of elementary type, is bounded by $(m^2/4)+m$. Assuming the Elementary Type Conjecture, this applies to all finitely generated maximal pro-$p$ Galois groups $G=G_F(p)$ of fields $F$ which contain a root of unity of order $p$. More generally, we provide such a uniform bound for the symbol length of all pullbacks $ρ^*(\barω)…

This https://arxiv.org/abs/2112.12268 has been replaced.
link: https://scholar.google.com/scholar?q=a

An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG
In this paper, we propose a new algebraic attack on stream ciphers. Starting from the well-known attack due to Courtois and Meier, we design an attack especially effective against nonlinear filter generators. We test it on two toy stream ciphers and we show that the level of security of one of stream ciphers submitted to the NIST competition on Lightweight Cryptography, WG-PRNG, is less than that stated before now.

This https://arxiv.org/abs/2101.10397 has been replaced.
link: https://scholar.google.com/scholar?q=a

Relative vanishing theorems for $\mathbf{Q}$-schemes
We prove the relative Grauert-Riemenschneider vanishing, Kawamata-Viehweg vanishing, and Kollár injectivity theorems for proper morphisms of schemes of equal characteristic zero, solving conjectures of Boutot and Kawakita. Our proof uses the Grothendieck limit theorem for sheaf cohomology and Zariski-Riemann spaces. We also show these vanishing and injectivity theorems hold for locally Moishezon (resp. projective) morphisms of quasi-excellent algebraic spaces admitting dualizing complexes and …

This https://arxiv.org/abs/2312.01183 has been replaced.
link: https://scholar.google.com/scholar?q=a

Comprehensive Robotic Cholecystectomy Dataset (CRCD): Integrating Kinematics, Pedal Signals, and Endoscopic Videos
In recent years, the potential applications of machine learning to Minimally Invasive Surgery (MIS) have spurred interest in data sets that can be used to develop data-driven tools. This paper introduces a novel dataset recorded during ex vivo pseudo-cholecystectomy procedures on pig livers, utilizing the da Vinci Research Kit (dVRK). Unlike current datasets, ours bridges a critical gap by offering not only full kinematic data but also capturing all pedal inputs used during the procedure and pr…

This https://arxiv.org/abs/2211.13913 has been replaced.
link: https://scholar.google.com/scholar?q=a

Constants for Artin like problems in Kummer and division fields
We apply the character sums method of Lenstra, Moree, and Stevenhagen, to explicitly compute the constants in the Titchmarsh divisor problem for Kummer fields and for division fields of Serre curves. We derive our results as special cases of a general result on the product expressions for the sums in the form $$\sum_{n=1}^{\infty}\frac{g(n)}{\#G(n)}$$ in which $g(n)$ is a multiplicative arithmetic function and $\{G(n)\}$ is a certain family of Galois groups. Our results extend the application o…

This https://arxiv.org/abs/2402.02039 has been replaced.
link: https://scholar.google.com/scholar?q=a

Hamiltonian analysis for perturbative $λR$ gravity
The Hamiltonian analysis for the linearized $λR$ gravity around the Minkowski background is performed. The first-class and second-class constraints for arbitrary values of $λ$ are presented, and two physical degrees of freedom are reported. In addition, we remove the second-class constraints, and the generalized Dirac brackets are constructed; then, the equivalence between General Relativity and the $λR$ theory is shown.

This https://arxiv.org/abs/2111.11661 has been replaced.
link: https://scholar.google.com/scholar?q=a

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
The Differential Privacy (DP) literature often centers on meeting privacy constraints by introducing noise to the query, typically using a pre-specified parametric distribution model with one or two degrees of freedom. However, this emphasis tends to neglect the crucial considerations of response accuracy and utility, especially in the context of categorical or discrete numerical database queries, where the parameters defining the noise distribution are finite and could be chosen optimally. Thi…

This https://arxiv.org/abs/2006.16530 has been replaced.
link: https://scholar.google.com/scholar?q=a

Moduli spaces of semistable pairs on projective Deligne-Mumford stacks
We generalize the construction of a moduli space of semistable pairs parametrizing isomorphism classes of morphisms from a fixed coherent sheaf to any sheaf with fixed Hilbert polynomial under a notion of stability to the case of projective Deligne-Mumford stacks. We study the deformation and obstruction theories of stable pairs, and then prove the existence of virtual fundamental classes for some cases of dimension two and three. This leads to a definition of Pandharipande-Thomas invariants on…

This https://arxiv.org/abs/2310.04781 has been replaced.
link: https://scholar.google.com/scholar?q=a

Unifying Foundation Models with Quadrotor Control for Visual Tracking Beyond Object Categories
Visual control enables quadrotors to adaptively navigate using real-time sensory data, bridging perception with action. Yet, challenges persist, including generalization across scenarios, maintaining reliability, and ensuring real-time responsiveness. This paper introduces a perception framework grounded in foundation models for universal object detection and tracking, moving beyond specific training categories. Integral to our approach is a multi-layered tracker integrated with the foundation …

This https://arxiv.org/abs/2203.07787 has been replaced.
link: https://scholar.google.com/scholar?q=a

On Galois inertial types of elliptic curves over $\mathbb{Q}_\ell$
We provide a complete, explicit description of the inertial Weil--Deligne types arising from elliptic curves over $\mathbb{Q}_\ell$ for $\ell$ prime.

This https://arxiv.org/abs/2401.07757 has been replaced.
link: https://scholar.google.com/scholar?q=a

Dynamic instability analysis for bumblebee black holes: the odd parity
Spherical black-hole (BH) solutions have been found in the bumblebee gravity where a vector field nonminimally couples to the Ricci tensor. We study dynamic (in)stability associated with the gravitational and vector perturbations of odd parity against these bumblebee BHs. Under the plane-wave approximation, we find that bumblebee BHs do not suffer ghost instability, but gradient instability and tachyonic instability exist when the bumblebee charge exceeds certain values. The existence of the in…

This https://arxiv.org/abs/2009.09160 has been replaced.
link: https://scholar.google.com/scholar?q=a

Poincaré duality for rigid analytic Hyodo--Kato theory
The purpose of this paper is to establish Hyodo--Kato theory with compact support for semistable schemes through rigid analytic methods. To this end we introduce several types of log rigid cohomology with compact support. moreover we show that additional structures on the (rigid) Hyodo--Kato cohomology and the Hyodo--Kato map introduced in our previous paper are compatible with Poincaré duality. Compared to the crystalline approach, the constructions are explicit yet versatile, and hence suita…

This https://arxiv.org/abs/2309.13586 has been replaced.
link: https://scholar.google.com/scholar?q=a

Task-Oriented Dexterous Hand Pose Synthesis Using Differentiable Grasp Wrench Boundary Estimator
This work tackles the problem of task-oriented dexterous hand pose synthesis, which involves generating a static hand pose capable of applying a task-specific set of wrenches to manipulate objects. Unlike previous approaches that focus solely on force-closure grasps, which are unsuitable for non-prehensile manipulation tasks (\textit{e.g.}, turning a knob or pressing a button), we introduce a unified framework covering force-closure grasps, non-force-closure grasps, and a variety of non-prehens…

This https://arxiv.org/abs/2202.13143 has been replaced.
link: https://scholar.google.com/scholar?q=a

Square-weighted zero-sum constants
Let $A\subseteq \mathbb Z_n$ be a subset. A sequence $S=(x_1,\ldots,x_k)$ in $\mathbb Z_n$ is said to be an $A$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ such that $a_1x_1+\cdots+a_kx_k=0$. By a square, we shall mean a non-zero square in $\mathbb Z_n$. We determine the smallest natural number $k$, such that every sequence in $\mathbb Z_n$ whose length is $k$, has a square-weighted zero-sum subsequence. We also determine the smallest natural number $k$, such that every sequ…

This https://arxiv.org/abs/2212.06103 has been replaced.
link: https://scholar.google.com/scholar?q=a

Solving the Teukolsky equation with physics-informed neural networks
We use physics-informed neural networks (PINNs) to compute the first quasi-normal modes of the Kerr geometry via the Teukolsky equation. This technique allows us to extract the complex frequencies and separation constants of the equation without the need for sophisticated numerical techniques, and with an almost immediate implementation under the \texttt{PyTorch} framework. We are able to compute the oscillation frequencies and damping times for arbitrary black hole spins and masses, with accur…

This https://arxiv.org/abs/2309.05310 has been replaced.
link: https://scholar.google.com/scholar?q=a

ImitationNet: Unsupervised Human-to-Robot Motion Retargeting via Shared Latent Space
This paper introduces a novel deep-learning approach for human-to-robot motion retargeting, enabling robots to mimic human poses accurately. Contrary to prior deep-learning-based works, our method does not require paired human-to-robot data, which facilitates its translation to new robots. First, we construct a shared latent space between humans and robots via adaptive contrastive learning that takes advantage of a proposed cross-domain similarity metric between the human and robot poses. Addit…

This https://arxiv.org/abs/2005.13598 has been replaced.
link: https://scholar.google.com/scholar?q=a

Classification of rational angles in plane lattices
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $π$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the lattice to vary arbitrarily. This classification turns out to be much less simple than could be expected, leading even to parametrizations involving rational points on certain algebraic curves of positive genus.Bulletin of the American Mathematical Society

This https://arxiv.org/abs/2305.20044 has been replaced.
link: https://scholar.google.com/scholar?q=a

Probabilistic Uncertainty Quantification of Prediction Models with Application to Visual Localization
The uncertainty quantification of prediction models (e.g., neural networks) is crucial for their adoption in many robotics applications. This is arguably as important as making accurate predictions, especially for safety-critical applications such as self-driving cars. This paper proposes our approach to uncertainty quantification in the context of visual localization for autonomous driving, where we predict locations from images. Our proposed framework estimates probabilistic uncertainty by cr…

This https://arxiv.org/abs/2202.09681 has been replaced.
link: https://scholar.google.com/scholar?q=a

A note on wormholes as compact stellar objects
A Morris-Thorne wormhole can only be sustained by violating the null energy condition, thereby requiring the existence of "exotic matter," a requirement that many researchers consider unphysical. Using a mostly qualitative approach, it is proposed in this note that the basic problems can be overcome by purely relativistic considerations. The implication is that a Morris-Thorne wormhole is likely to be a compact stellar object.

This https://arxiv.org/abs/2404.01003 has been replaced.
link: https://scholar.google.com/scholar?q=a

On the Brun--Titchmarsh theorem
The classical Brun--Titchmarsh theorem gives an upper bound, which is of correct order of magnitude in the full range, for the number of primes $p\leqslant x$ satisfying $p\equiv a\bmod q$. We strength this inequality for $\log q/\log x$ in different ranges, improving upon previous works by Motohashi, Goldfeld, Iwaniec, Friedlander and Iwaniec, and Maynard for general or special moduli. In particular, we obtain a Burgess-like constant in the full range $q